SOME DISCUSSIONS ABOUT THE SIEVING SIZE ANALYSIS

Some Sieving Algorithms for Lattice Problems

We study the algorithmic complexity of lattice problems based on the sieving technique due to Ajtai, Kumar, and Sivakumar [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank integer lattice L ⊆ Qn, the subspace avoiding problem SAP, defined by Blömer and Naewe [BN07], is to find a shortest vector in L \ M. We first give a 2O(n+k log k) time algorithm to solve the subspace avoiding pr...

Some factors affecting sieving performance and efficiency

Some discussions on uncertain measure

This paper will discuss some structural characteristics of uncertain measure. Some new convergence concepts of uncertain sequence are then introduced and the relationships among these convergence concepts are investigated. Finally, several inequalities of uncertain variables are obtained and their applications are discussed.

Some discussions on strong interaction

[Abstract] Using the gauge field model with massive gauge bosons, we could construct a new model to describe the strong interaction. In this new quantum chromodynamics(QCD) model, we will introduce two sets of gluon fields, one set is massive and another set is massless. Correspondingly, there may exists three sets of glueballs which have the same spin-parity but have different masses. A possib...

Some practical remarks about Binary Decision Diagram size reduction

In this paper the new spectral method of the variable ordering in the Binary Decision Diagram (BDD) is introduced. The problem to find the best order is defined as NP-hard, and optimal solution can not be finding because optimizing algorithm is running in O(n!2n) time, and calculations can not be done for the large n. Such complexity was obviously improved in many algorithms but as will be demo...